Irreducible polynomial

Results: 71



#Item
11The  Approximate Irreducible Factorization of a Univariate Polynomial. Revisited Zhonggang Zeng Northeastern Illinois University

The Approximate Irreducible Factorization of a Univariate Polynomial. Revisited Zhonggang Zeng Northeastern Illinois University

Add to Reading List

Source URL: issac2009.kias.re.kr

Language: English - Date: 2009-07-31 09:27:35
1212. Integer polynomials Po-Shen Loh CMU Putnam Seminar, Fall

12. Integer polynomials Po-Shen Loh CMU Putnam Seminar, Fall

Add to Reading List

Source URL: www.math.cmu.edu

Language: English - Date: 2012-12-05 20:42:31
13Specification of Data Types and Conversions version 1.0 NTT Secure Platform Laboratories, NTT Corporation March 2, 2015

Specification of Data Types and Conversions version 1.0 NTT Secure Platform Laboratories, NTT Corporation March 2, 2015

Add to Reading List

Source URL: info.isl.ntt.co.jp

Language: English - Date: 2015-03-02 00:44:50
14Elliptic Periods & Applications R. Lercier DGA & University of Rennes — France email : reynald.lercier(at)m4x.org www : http://perso.univ-rennes1.fr/reynald.lercier/

Elliptic Periods & Applications R. Lercier DGA & University of Rennes — France email : reynald.lercier(at)m4x.org www : http://perso.univ-rennes1.fr/reynald.lercier/

Add to Reading List

Source URL: ecc2011.loria.fr

Language: English - Date: 2011-09-30 12:40:03
15Speaker : K.N. Raghavan Title : Branching laws for certain classical group pairs. Abstract : How does an irreducible representation (finite dimensional, say polynomial) of GL(n, C) break up into irreducibles when restric

Speaker : K.N. Raghavan Title : Branching laws for certain classical group pairs. Abstract : How does an irreducible representation (finite dimensional, say polynomial) of GL(n, C) break up into irreducibles when restric

Add to Reading List

Source URL: conferences.math.tifr.res.in

Language: English - Date: 2013-02-10 23:10:24
    16The Polynomial method: Problem Set 2  Due noon, Friday, May 15th 1. Prove that Theorem 2.1 of Chapter 3 (of the lecture notes) remains valid also after removing the restrictions about the curves being irreducible and dis

    The Polynomial method: Problem Set 2 Due noon, Friday, May 15th 1. Prove that Theorem 2.1 of Chapter 3 (of the lecture notes) remains valid also after removing the restrictions about the curves being irreducible and dis

    Add to Reading List

    Source URL: www.math.caltech.edu

    Language: English - Date: 2015-04-29 16:20:41
      17Improved algorithms for solving bivariate systems via Rational Univariate Representations Yacine Bouzidi, Sylvain Lazard, Guillaume Moroz, Marc Pouget, Fabrice Rouillier, Michael Sagraloff  To cite this version:

      Improved algorithms for solving bivariate systems via Rational Univariate Representations Yacine Bouzidi, Sylvain Lazard, Guillaume Moroz, Marc Pouget, Fabrice Rouillier, Michael Sagraloff To cite this version:

      Add to Reading List

      Source URL: people.mpi-inf.mpg.de

      Language: English - Date: 2015-04-16 04:58:05
      18Looking beyond XTR Wieb Bosma1 , James Hutton2 , and Eric R. Verheul3 1 Mathematisch Instituut, Universiteit Nijmegen, Postbus 9010, 6500 GL Nijmegen, The Netherlands,

      Looking beyond XTR Wieb Bosma1 , James Hutton2 , and Eric R. Verheul3 1 Mathematisch Instituut, Universiteit Nijmegen, Postbus 9010, 6500 GL Nijmegen, The Netherlands,

      Add to Reading List

      Source URL: www.math.ru.nl

      Language: English - Date: 2003-03-04 03:36:09
      19Contents  Automated Handling and Proving of Geometric Theorems Dongming Wang . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .  1

      Contents Automated Handling and Proving of Geometric Theorems Dongming Wang . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1

      Add to Reading List

      Source URL: www.math.ru.nl

      Language: English - Date: 2004-03-18 07:16:49